Feasibility Conditions on the Parameters of a Strongly Regular Graph

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Feasibility Conditions on the Parameters of a Strongly Regular Graph

We consider a strongly regular graph, G, and associate a three dimensional Euclidean Jordan algebra, V, to the adjacency matrix A of G. Then, by considering convergent series of Hadamard powers of the idempotents of the unique complete system of orthogonal idempotents of V, we establish new feasibility conditions for the existence of strongly regular graphs.

متن کامل

On the Strongly Regular Graph of Parameters

In an attempt to find a strongly regular graph of parameters (99, 14, 1, 2) or to disprove its existence, we studied its possible substructure and constructions.

متن کامل

Generalized Krein Parameters of a Strongly Regular Graph

We consider the real three-dimensional Euclidean Jordan algebra associated to a strongly regular graph. Then, the Krein parameters of a strongly regular graph are generalized and some generalized Krein admissibility conditions are deduced. Furthermore, we establish some relations between the classical Krein parameters and the generalized Krein parameters.

متن کامل

the effect of taftan pozzolan on the compressive strength of concrete in the environmental conditions of oman sea (chabahar port)

cement is an essential ingredient in the concrete buildings. for production of cement considerable amount of fossil fuel and electrical energy is consumed. on the other hand for generating one tone of portland cement, nearly one ton of carbon dioxide is released. it shows that 7 percent of the total released carbon dioxide in the world relates to the cement industry. considering ecological issu...

New Feasibility Conditions for Directed Strongly Regular Graphs

We prove two results for directed strongly regular graphs that have an eigenvalue of multiplicity less than k, the common out-degree of each vertex. The first bounds the size of an independent set, and the second determines an eigenvalue of the subgraph on the out-neighborhood of a vertex. Both lead to new nonexistence results for parameter sets.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Discrete Mathematics

سال: 2011

ISSN: 1571-0653

DOI: 10.1016/j.endm.2011.10.002